Selection principles in topology: New directions

نویسنده

  • Marion Scheepers
چکیده

Most mathematical theories start from humble beginnings where a mathematician while examining some mathematical object makes fundamental, but ad hoc, observations. When the significance of these observations are realized some organised study begins during which these are explored in detail for some central examples. In this second part of theory building some general themes of investigation are identified. Then, it seems, one enters a third phase in which several mathematicians join in developing the theory. Typically this third phase is marked with much innovation, rapid expansion and application to other areas of mathematics. This brief discussion of the area of Selection principles in Topology will be organized according to these three phases. 1 The beginnings Selection principles appear in diagonalization arguments in mathematics. The early sources for selection principles in topology come from measure theory and basis theory in metric spaces. Basis theoretic sources In [26] K. Menger defined the Menger basis property for metric spaces: A met/-ric space (X, d) has the Menger basis property if there is for each base B of X a sequence (Bn : n ∈ N) of sets from the basis such that limn→∞ diamd(Bn) = 0, and {Bn : n ∈ N} is a cover for X. Though at first glance this concept does not seem to be related to diagonalization, evidence that it is came quickly when in [17] W. Hurewicz proved two fundamental theorems about the Menger basis property. The first of the two is that the metric space (X, d) has the Menger basis property if, and only if, for each sequence (Un : n ∈ N) of open covers of X there is a sequence (Vn : n ∈ N) 1Invited talk at the IMC “Filomat 2001”, Nǐs, August 26–30, 2001 2000 Mathematics Subject Classification: 54D20, 54B20, 54C35, 03E02, 91A44

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some New Directions in Infinite-combinatorial Topology

We give a light introduction to selection principles in topology, a young subfield of infinite-combinatorial topology. Emphasis is put on the modern approach to the problems it deals with. Recent results are described, and open problems are stated. Some results which do not appear elsewhere are also included, with proofs.

متن کامل

3D BENCHMARK RESULTS FOR ROBUST STRUCTURAL OPTIMIZATION UNDER UNCERTAINTY IN LOADING DIRECTIONS

This study has been inspired by the paper "An efficient 3D topology optimization code written in MATLAB” written by Liu and Tovar (2014) demonstrating that SIMP-based three-dimensional (3D) topology optimization of continuum structures can be implemented in 169 lines of MATLAB code. Based on the above paper, we show here that, by simple and easy-to-understand modificati...

متن کامل

Selection Principles in Mathematics: a Milestone of Open Problems

We survey some of the major open problems involving selection principles, diagonalizations, and covering properties in topology and infinite combinatorics. Background details, definitions and motivations are also provided. Remark. The current version of this paper incorporates new results which were obtained after the publication of this paper. Please inform us of any solution or problem which ...

متن کامل

A New Configuration for Power Sharing of Two Z-Source Inverters

This paper presents a new structure to provide the ability for power sharing of two Z-source inverters. According to the operation principles of Z-source inverters, only one input source supplies the circuit, which is a limitation particularly for the stand alone systems feeded by limited output power such as photovoltaics and feul cells. Furthermore; if one source fails to supply,  the lo...

متن کامل

An Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks Using Fuzzy Inference Systems

An efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. The implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. According to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses Fuzzy Inference Systems to select cluster head. The alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004